Genetic algorithm for scheduling of laboratory personnel.
نویسندگان
چکیده
BACKGROUND Staffing core laboratories with appropriate skilled workers requires a process to schedule these individuals so that all workstations are appropriately filled and all the skills of each worker are exercised periodically to maintain competence. METHODS We applied a genetic algorithm to scheduling laboratory personnel. Our program, developed in Visual Basic 4.0, maximizes the value of a fitness function that measures how well a given scheduling of individuals and their skills matches a set of work tasks for a given work shift. The user provides in an Excel spreadsheet the work tasks, individuals available to work on any given date, and skills each individual possesses. The user also specifies the work shift to be scheduled, the range of dates to be scheduled, the number of days that an individual stays on a given workstation before rotating, and various parameters for the genetic algorithm if they differ from the default values. RESULTS For >22 months, the program matched individuals to those tasks for which they were qualified and maintained personnel skills by rotating job duties. The schedules generated by the program allowed supervisory personnel to anticipate dates far in advance of when worker availability would be limited, so staffing could be adjusted. In addition, the program helped to identify skills for which too few individuals had been trained. This program has been well accepted by the staff in the clinical laboratories of a 670-bed university medical center, saving 37 h of labor per month, or approximately $11,000 per year, in time that supervisory personnel have spent developing work schedules. CONCLUSIONS The genetic algorithm approach appears to be useful for scheduling in highly technical work environments that employ multiskilled workers.
منابع مشابه
An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملA HYBRID GENETIC ALGORITHM FOR A BI-OBJECTIVE SCHEDULING PROBLEM IN A FLEXIBLE MANUFACTURING CELL
This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...
متن کاملA Genetic Algorithm Developed for a Supply Chain Scheduling Problem
This paper concentrates on the minimization of total tardiness and earliness of orders in an integrated production and transportation scheduling problem in a two-stage supply chain. Moreover, several constraints are also considered, including time windows due dates, and suppliers and vehicles availability times. After presenting the mathematical model of the problem, a developed version of GA c...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Clinical chemistry
دوره 47 1 شماره
صفحات -
تاریخ انتشار 2001